Correlation Testing for Affine Invariant Properties on F np in the High Error Regime ∗

نویسندگان

  • Hamed Hatami
  • Shachar Lovett
چکیده

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a function f : Fp → Fp with polynomials of degree at most d ≤ p is non-negligible, while making only a constant number of queries to the function. This is an instance of correlation testing. In this framework, a fixed test is applied to a function, and the acceptance probability of the test is dependent on the correlation of the function from the property. This is an analog of proximity oblivious testing, a notion coined by Goldreich and Ron, in the high error regime. In this work, we study general properties which are affine invariant and which are correlation testable using a constant number of queries. We show that any such property (as long as the field size is not too small) can in fact be tested by Gowers uniformity tests, and hence having correlation with the property is equivalent to having correlation with degree d polynomials for some fixed d. We stress that our result holds also for non-linear properties which are affine invariant. This completely classifies affine invariant properties which are correlation testable. The proof is based on higher-order Fourier analysis. Another ingredient is a nontrivial extension of a graph theoretical theorem of Erdös, Lovász and Spencer to the context of additive number theory. AMS Subject Classification: 68Q87, 11B30

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a function f : F p → Fp with polynomials of degree at most d ≤ p is non-negligible, while making only a constant number of queries to the function. This is an instanc...

متن کامل

Limits on the Rate of Locally Testable Affine-Invariant Codes

Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, “algebraic property testing” is not well-understood. A significant obstacle to a better understanding, was a lack of a concrete definition that abstracted known testable algebraic properties and reflected their testability. This obstacle was rem...

متن کامل

Testing Low Complexity Affine-Invariant Properties

Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of multivariate functions over finite fields is testable with a constant number of queries. This immediately reproves, for instance, that the Reed-Muller code over Fp of d...

متن کامل

Some closure features of locally testable affine - invariant properties ARCHMEs by Alan

We prove that the class of locally testable affine-invariant properties is closed under sums, intersections and "lifts". The sum and intersection are two natural operations on linear spaces of functions, where the sum of two properties is simply their sum as a vector space. The "lift" is a less well-studied property, which creates some interesting affine-invariant properties over large domains,...

متن کامل

A New Near Optimal High Gain Controller For The Non-Minimum Phase Affine Nonlinear Systems

In this paper, a new analytical method to find a near-optimal high gain controller for the non-minimum phase affine nonlinear systems is introduced. This controller is derived based on the closed form solution of the Hamilton-Jacobi-Bellman (HJB) equation associated with the cheap control problem. This methodology employs an algebraic equation with parametric coefficients for the systems with s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011